The inverse 1-center location problem on a tree
نویسندگان
چکیده
In an inverse network 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes a 1-center of the network. In this paper, we consider the inverse 1-center location problem on an unweighted tree network T with n + 1 vertices in which we are allowed to increase or reduce the edge lengths within certain bounds. The problem can be solved in O(n) time provided that no essential topology change occurs. Dropping this condition, an O(nr) time algorithm solves the problem where r, r < n, is the compressed depth of the tree network T rooted in s.
منابع مشابه
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
This article considers the inverse absolute and the inverse vertex 1-center location problems with uniform cost coefficients on a tree network T with n + 1 vertices. The aim is to change (increase or reduce) the edge lengths at minimum total cost with respect to given modification bounds such that a prespecified vertex s becomes an absolute (or a vertex) 1-center under the new edge lengths. Fir...
متن کاملCombinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
In an inverse network absolute (or vertex) 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes an absolute (or a vertex) 1-center of the network. In this article, the inverse absolute and vertex 1-center location problem on trees with n + 1 vertices is considered whe...
متن کاملCombinatorial algorithms for inverse absolute 1-center location problems on trees
In an inverse network absolute (or vertex) 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes an absolute (or a vertex) 1-center of the network. In this article, the inverse absolute and vertex 1-center location problems on unweighted trees with n + 1 vertices are c...
متن کاملInverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کاملUnweighted p-center problem on extended stars
An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.
متن کامل